Solving linear systems with vectorized WZ factorization
نویسنده
چکیده
Abstract In the paper we present a vectorized algorithm for WZ factorization of a matrix which was implemented with the BLAS1 library. We present the results of numerical experiments which show that vectorization accelerates the sequential WZ factorization. Next, we parallelized both algorithms for a two-processor shared memory machine using the OpenMP standard. We present performances of these four algorithms on a two-Pentium III machine with a Linux system (the parallelized sequential algorithm is better than the normal sequential one, but the parallelized vectorized algorithm is very similar in its performance to the non-parallelized vectorized one).
منابع مشابه
WZ factorization via Abay-Broyden-Spedicato algorithms
Classes of Abaffy-Broyden-Spedicato (ABS) methods have been introduced for solving linear systems of equations. The algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. Here, we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW factorizations of a nonsingular matrix as well as...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملThe inverse iteration with the WZ factorization used to the Markovian models
In the article a new approach for solving Markovian linear systems is presented. It is the inverse iteration with the use of the WZ factorization. The paper contains the theoretical base of the method and numerical experiment results where the accuracy and the performance time were investigated. A modified (with the use of the SBLAS library and the Harwell-Boeing sparse matrix storage scheme) m...
متن کاملParallel Algorithm for Symmetric Positive Definite Banded Linear Systems: A Divide and Conquer Approach
The WZ factorization for the solution of symmetric positive definite banded linear systems when combined with a partitioned scheme, renders a divide and conquer algorithm. The WZ factorization of the coefficient matrix in each block has the properties: the vector [a1, . . . , aβ , 0, . . . , 0, an−β+1, . . . , an] is invariant under the transformation W where β is the semibandwidth of the coeff...
متن کاملParallel WZ factorization on mesh multiprocessors
We present a parallel algorithm for the QIF (Quadrant Interlocking Factorization) method, which solves linear equation systems using WZ factorization. The parallel algorithm we developed is general in the sense that it does not impose any restrictions on the size of the problem and that it is independent from the dimensions oJ the mesh. The result is an efficient algorithm using half the messag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annales UMCS, Informatica
دوره 1 شماره
صفحات -
تاریخ انتشار 2003